On Quantified Propositional Logics and the Exponential Time Hierarchy
نویسندگان
چکیده
منابع مشابه
On Quantified Propositional Logics and the Exponential Time Hierarchy
We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae. We show that the truth evaluation for ADQBF is AEXPTIME(poly)-complete. We also identify fragments for which the problem is complete for the levels of the e...
متن کاملA hierarchy of implicational (semilinear) logics: the propositional case
In Abstract Algebraic Logic the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this kind of process one considers the Leibniz relation of indiscernible, i.e. logically equivalent, formulae. Such approach has resulted in a classification of logics partly based on generalizations of equivalence connectives: ...
متن کاملComplete Problems of Propositional Logic for the Exponential Hierarchy
Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems. In this work a generalization of propositional logic is investigated which fills this gap with the introduction of Boolean higher-order quantifiers or equivalently Boolean Skolem functions. This builds on the important results of Wrathall and Stockmeyer regarding compl...
متن کاملPropositional Logics on the Computer
The purpose of the paper is to present the Logics Workbench, an interactive system aiming to facilitate the access to logical formalisms for nonspecialists as well as specialists. It is an integrated system which provides a library of the most important propositional calculi and many algorithms in this area. Special emphasis is put on a clear design of the human interface and a powerful informa...
متن کاملModal Logics with a Hierarchy of Local Propositional Quantiiers (abstract)
Although modal logics are most commonly studied in their propositional forms, which may often be interpreted in rst order logic, the topic of modal logics with second order expressive power is almost as old as the eld itself. Motivated by earlier applications of quantiication over propositions in the context of conditional logic, Kripke's early work on the semantics of modal logic Kri59] alread...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.226.14